Low Rank Language Models for Small Training Sets
نویسندگان
چکیده
منابع مشابه
Minimum rank error training for language modeling
Discriminative training techniques have been successfully developed for many pattern recognition applications. In speech recognition, discriminative training aims to minimize the metric of word error rate. However, in an information retrieval system, the best performance should be achieved by maximizing the average precision. In this paper, we construct the discriminative n-gram language model ...
متن کاملSpatial Design for Knot Selection in Knot-Based Low-Rank Models
Analysis of large geostatistical data sets, usually, entail the expensive matrix computations. This problem creates challenges in implementing statistical inferences of traditional Bayesian models. In addition,researchers often face with multiple spatial data sets with complex spatial dependence structures that their analysis is difficult. This is a problem for MCMC sampling algorith...
متن کاملGeneralized Low Rank Models
Principal components analysis (PCA) is a well-known technique for approximating a data set represented by a matrix by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in data analysis, such as nonnegative matrix factorization, matrix...
متن کاملLow-Rank Approximations for Spatial Channel Models
We analyze the problem of approximating vectors that are superpositions of many closely spaced steering vectors. Such vectors appear in realistic models for wireless communication channels and describe single clusters of scatterers. We question the practice of using a dictionary of steering vectors in order to find a sparse approximation. Alternative dictionaries can be obtained from the Karhun...
متن کاملUnifying Low-Rank Models for Visual Learning
Many problems in signal processing, machine learning and computer vision can be solved by learning low rank models from data. In computer vision, problems such as rigid structure from motion have been formulated as an optimization over subspaces with fixed rank. These hard -rank constraints have traditionally been imposed by a factorization that parameterizes subspaces as a product of two matri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2011
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2011.2160850